Relative truth, speaker commitment, and control of implicit arguments
نویسندگان
چکیده
منابع مشابه
Relative truth, speaker commitment, and control of implicit arguments
Recent arguments for relativist semantic theories have centered on the phenomenon of “faultless disagreement.” This paper offers independent motivation for such theories, based on the interpretation of predicates of personal taste in certain attitude contexts and presuppositional constructions. It is argued that the correct interpretation falls out naturally from a relativist theory, but requir...
متن کاملHedging and Speaker Commitment
Hedging is a behavior wherein speakers or writers attempt to distance themselves from the proposition they are communicating. Hedge terms include items such as ”I think X” or ”It’s sort of Y”. Identifying such behaviors is important for extracting meaning from speech and text, and can also reveal information about the social and power relations between the conversants. Yet little research has b...
متن کاملEvidence Games: Truth and Commitment
An evidence game is a strategic disclosure game in which an agent who has different pieces of verifiable evidence decides which ones to disclose and which ones to conceal, and a principal chooses an action (a “reward”). The agent’s preference is the same regardless of his information (his “type”)—he always prefers the reward to be as high as possible—whereas the principal prefers the reward to ...
متن کاملQualia Structure and the Accessibility of Arguments : Japanese Internally-Headed Relative Clauses with Implicit Target
The relationship between lexicon and pragmatics has been one of the most controversial issues in recent studies in linguistics. Lexicon in the conservative definition encodes only the information responsible for the regular syntactic mapping of lexical items. Any information that is not directly reflected in the syntactic structure is attributed to pragmatics. A more recent trend, in contrast, ...
متن کاملImplicit Evaluation of “auto” Variables and Arguments
Many people would expect C to be of type matrix as well. Whether C is a matrix depends on the implementation of operator∗. In the case that the operator returns a matrix then C is a matrix. For the sake of performance, computationally expensive operators very often return an Expression Template and delay the evaluation to a later point in time when it can be performed more efficiently—because w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Synthese
سال: 2007
ISSN: 0039-7857,1573-0964
DOI: 10.1007/s11229-007-9280-8